| 翻訳と辞書 |
| Strongly-connected digraph ： ウィキペディア英語版 |
Connectivity (graph theory)
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other.〔 It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its robustness as a network.
==Connected graph==
A graph is connected when there is a path between every pair of vertices. In a connected graph, there are no unreachable vertices. A graph that is not connected is disconnected.
A graph with just one vertex is connected. An edgeless graph with two or more vertices is disconnected.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Connectivity (graph theory)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|